﻿using System;

class Program
{
    //判断是否为素数
    static bool isPrime(int n)
    {
        bool sign = true;
        for (int i = 2; i < n; i++)
        {   //排除特殊情况
            if (n <= 1)
            {
                sign = false;
                break;
            }
            else if (n == 2)
            {
                break;
            }
            else
            {
                if (n % i == 0)
                {
                    sign = false;
                    break;
                }
            }
        }
        return sign;
    }
       //找到满足条件的两个素数
    static List<int> getPrimes(int n)
    {
        List<int> list = new List<int>();
        for(int i = 2; i < n; i++)
        {
            if (isPrime(i) && isPrime(n - i)){
                list.Add(i);
                list.Add(n - i);
                break;
            }
        }

        return list;
    }

    public static void Main(string[] args)
    {
        int min, max;
        min = 6;
        max = 100;
        List<int> ints = new List<int>();
       for(int i = min; i <= max; i += 2)
        {
            ints=getPrimes(i);
            Console.WriteLine(i + "=" + ints[0] + "+"+ints[1]);
        }
    }
}
